Performance of Turbo Codes with Matrix Interleavers
نویسنده
چکیده
ةصلاخلا : برتلا تارفيش تذوحتسا دقل و ً ارخؤ م ب سب نيثحا بلا نم ر يثكلا ما متها ى لع ب أ هابلا ا هئاد ـ د نع ر ـ ل ةضفخنملا مي قلا ) SNR .( اًءز ج ر ثعبملا ر بتعيو اً ماه شلا هذ ه ميمصت ن م في تار . م ظعم ضرتفتو لأا ،ةيئاوشع تار ثعبم لاجملا اذه يف ثاحب أ سرد نف ثحبلا اذ ه يف ا م أ مادختساب و برت تارفي ش ءاد ّ يفص تارثعبم ،ة و ب ةقلعتملا لماوعلا نم ديدعلا أ د اهئا ميمصت لثم ، أ لوط ريثأ تو ،ةيفصلا ةرثعبملا داعب لخد ملا ني ب ةر ثعبملا لدا بت ريثأ تو ،ريف شتلا ك ف تارود دد عو ةر ثعبملا ني ب ل عافتلاو ،ةر ثعبملا جرخملاو . رهظتو أ ةاآاحملا جئاتن مي ةيفصلا تارثعبملا ن أ نك عبملل ةسفانم نوكت ن لأل ةيئاوشعلا تارث لاوط ةريصقلا .
منابع مشابه
On the Design and Performance of high throughput parallel block and random interleavers for Turbo Codes
It is known that one of the essential building blocks of turbo codes is the interleaver and its design using random, semi-random (S-Random) and deterministic permutations. In this paper, two new types of turbo code interleavers, Enhanced Block S-Random (EBSR) interleaver is proposed. The design algorithm for the new interleaver is described in depth, and the simulation results are compared to t...
متن کاملIDMA Based on Deterministic Interleavers
Previously, the interleavers is generated randomly for users of Interleave Division Multiple Access (IDMA) systems. Therefore, transmitting the entire chip-level interleaver matrix or power interleaver generation is required, which either adds redundancy or increases delay. In this paper, we propose to use deterministic chip-level interleavers for multiple users of IDMA systems. These chip-leve...
متن کاملOn theory and Performance of high throughput parallel block and S- random interleavers for Turbo Codes
It is known that one of the essential building blocks of turbo codes is the interleaver and its design using random, semi-random (S-Random) and deterministic permutations. In this paper, two new types of turbo code interleavers, Modified Block S-Random (MBSR) interleaver and Modified Matched S-Random (MMSR) interleaver are proposed. The design algorithm for the new interleavers is described in ...
متن کاملQuadratic Permutation Polynomial Interleavers for 3gpp Lte Turbo Codes
The contention-free property of interleavers is one of the key design requirements for the parallel decoding implementations of turbo codes in order to achieve high decoding throughput. Quadratic permutation polynomial (QPP) interleavers are maximum contention-free (MCF), i.e., every factor dividing the interleaver length becomes a possible degree of parallel decoding processing without any mem...
متن کاملStream-oriented turbo codes
This work considers the design and performance of a stream-oriented approach to turbo codes which avoids the need for data framing. The stream paradigm applies to both serial and parallel turbo codes using continuous, free-running constituent encoders along with continuous, periodic interleavers. A stream-oriented turbo code based on parallel concatenated convolutional codes (PCCC) is considere...
متن کاملVariance of the turbo code performance bound over the interleavers
In this correspondence, we evaluate the variance of the union performance bound for a rate-1 3 turbo code over all possible interleavers of length , under the assumption of a maximum-likelihood (ML) decoder. Theoretical and simulation results for turbo codes with two-memory component codes indicate that the coefficient of variation of the bound increases with the signal-to-noise ratio and decre...
متن کامل